/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package BounderyPack;

import MathLib.triangulation.SaveStructures.Node;

/**
 *
 * @author mark
 */
public class BounderyNodePair {
    protected Node A;
    protected Node B;

    public BounderyNodePair(Node A, Node B) {
        this.A = A;
        this.B = B;
    }

    public Node getA() {
        return A;
    }

    public void setA(Node A) {
        this.A = A;
    }

    public Node getB() {
        return B;
    }

    public void setB(Node B) {
        this.B = B;
    }

    public boolean contains(Node A, Node B){
        if((this.A.equals(A)&&this.B.equals(B))||(this.A.equals(B)&&this.B.equals(A))){
            return true;
        }else{
            return false;
        }
    }
    public boolean contains(Node A){
        if((this.A.equals(A)||this.B.equals(A))){
            return true;
        }else{
            return false;
        }
    }
    public boolean contains(int i){
        if((this.A.Number==i)||(this.B.Number==i)){ //TODO !!!!!!!!!!!!! перевірити чи потрібно -1 чи ні
            return true;
        }else{
            return false;
        }
    }
}
